Bayesian Estimation of Conditional Independence Graphs Improves Functional Connectivity Estimates

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimation of local independence graphs via Hawkes processes to unravel functional neuronal connectivity∗

We will present an adaptation of the Least Absolute Shrinkage and Selection Operator LASSO method to the analysis of correlation dynamics of small neuronal populations. Indeed, due to its low computational cost, Lasso is an attractive regularization method for high dimensional statistical settings. Within our framework, we consider multivariate counting processes depending on an unknown functio...

متن کامل

Fast Conditional Independence-based Bayesian Classifier

Machine Learning (ML) has become very popular within Data Mining (KDD) and Artificial Intelligence (AI) research and their applications. In the ML and KDD contexts, two main approaches can be used for inducing a Bayesian Network (BN) from data, namely, Conditional Independence (CI) and the Heuristic Search (HS). When a BN is induced for classification purposes (Bayesian Classifier BC), it is po...

متن کامل

Conditional independence and chain event graphs

Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However, it is not unusual for a model to be specified from a description of how a process unfolds (i.e. via its event tree), rather than through relationships between a given set of measurements. Here we introduce a new mixed...

متن کامل

Independence Free Graphs and Vertex Connectivity Augmentation

Given an undirected graph G and a positive integer k, the k-vertex-connectivity augmentation problem is to find a smallest set F of new edges for which G + F is k-vertex-connected. Polynomial algorithms for this problem have been found only for k≤ 4 and a major open question in graph connectivity is whether this problem is solvable in polynomial time in general. In this paper we develop an algo...

متن کامل

Switching Activity Estimation Based on Conditional Independence

Power estimation in combinational modules is addressed from a probabilistic point of view. The zero-delay hypothesis is considered and under highly correlated input streams, the activities at the primary outputs and all internal nodes are estimated. For the first time, the relationship between logical and probabilistic domains is investigated and two new concepts conditional independence and is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PLOS Computational Biology

سال: 2015

ISSN: 1553-7358

DOI: 10.1371/journal.pcbi.1004534